A note on the scaled total least squares problem
نویسندگان
چکیده
In this note, we present two results on the scaled total least squares problem. First, we discuss the relation between the scaled total least squares and the least squares problems. We derive an upper bound for the difference between the scaled total least squares solution and the least squares solution and establish a quantitative relation between the scaled total least squares residual and the least squares residual. Second, we give a perturbation analysis of the scaled total least squares problem. Numerical experiments in comparing our results with existing results are demonstrated. © 2007 Elsevier Inc. All rights reserved. AMS classification: 15A18; 65F20; 65F25; 65F50
منابع مشابه
Unifying Least Squares, Total Least Squares and Data Least Squares
The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the vector b and/or the matrix A such that the corrected system is compatible. In ordinary least squares (LS) the correction is restricted to b, while in data least squares (DLS) it is restricted to A. In scaled total least squares (Scaled TLS) [15], corrections to both b and A are allowed, ...
متن کاملBounds for the Least Squares Residual Using Scaled Total Least Squares
The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the data to make the corrected system compatible. In ordinary least squares (LS) the correction is restricted to the right hand side b, while in scaled total least squares (Scaled TLS) [10; 7] corrections to both b and A are allowed, and their relative sizes are determined by a real positive...
متن کاملResidual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
Minimum residual norm iterative methods for solving linear systems Ax = b can be viewed as, and are often implemented as, sequences of least squares problems involving Krylov subspaces of increasing dimensions. The minimum residual method (MINRES) [C. Paige and M. Saunders, SIAM J. Numer. Anal., 12 (1975), pp. 617–629] and generalized minimum residual method (GMRES) [Y. Saad and M. Schultz, SIA...
متن کاملBackward perturbation analysis for scaled total least-squares problems
The scaled total least-squares (STLS) method unifies the ordinary least-squares (OLS), the total leastsquares (TLS), and the data least-squares (DLS) methods. In this paper we perform a backward perturbation analysis of the STLS problem. This also unifies the backward perturbation analyses of the OLS, TLS and DLS problems. We derive an expression for an extended minimal backward error of the ST...
متن کاملAn Algorithm for Solving Scaled Total Least Squares Problems
In this paper, we present a rankrevealing two-sided orthogonal decomposition method for solving the STLS problem. An error analysis of the algorithm is given. Our numerical experiments show that this algorithm computes the STLS solution as accurate as the SVD method with less computation.
متن کامل